Pii: S0010-4485(98)00080-3

نویسندگان

  • Hyeong In Choi
  • Chang Yong Han
  • Hwan Pyo Moon
  • Kyeong Hah Roh
  • Nam-Sook Wee
چکیده

We present a new approach to medial axis transform and offset curve computation. Our algorithm is based on the domain decomposition scheme which reduces a complicated domain into a union of simple subdomains each of which is very easy to handle. This domain decomposition approach gives rise to the decomposition of the corresponding medial axis transform which is regarded as a geometric graph in the three dimensional Minkowski space R. Each simple piece of the domain, called the fundamental domain, corresponds to a space-like curve in R. Then using the new spline, called the Minkowski Pythagorean hodograph curve which was recently introduced, we approximate within the desired degree of accuracy the curve part of the medial axis transform with a G cubic spline of Minkowski Pythagorean hodograph. This curve has the property of enabling us to write all offset curves as rational curves. Further, this Minkowski Pythagorean hodograph curve representation together with the domain decomposition lemma makes the trimming process essentially trivial. We give a simple procedure to obtain the trimmed offset curves in terms of the radius function of the MPH curve representing the medial axis transform. q 1999 Elsevier Science Limited. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smoothing haptic interaction using molecular force calculations

This paper presents a new method for smoothing haptic interaction with molecular force calculations that uses Lennard-Jones forcefield. The gradient of the forcefield is used unaltered when the distance between two atoms is greater than the sum of their van der Waals radii. However, when they are smaller, a hard-surface wall implemented using a spring model is used to repel two atoms. This elim...

متن کامل

Approximation of developable surfaces with cone spline surfaces

Developable surfaces are modelled with pieces of right circular cones. These cone spline surfaces are well-suited for applications: They possess degree two parametric and implicit representations. Bending sequences and the development can be explicitly computed and the offsets are of the same type. The algorithms are based on elementary analytic and constructive geometry. There appear interesti...

متن کامل

Pii: S0010-4485(99)00080-9

Presented in the paper is a tool-path planning algorithm for direction-parallel area milling consisting of three modules: (1) finding the optimal inclination; (2) calculating and storing tool-path elements; and (3) tool-path linking. For the optimal inclination, we suggest an algorithm that selects an inclination by reflecting the shape of the machining area as well as the tool-path interval. W...

متن کامل

Pii: S0010-4485(98)00066-9

This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) sampling the offset curve or surface based on bounds on second derivatives; (3) interpolating these points; and (4) removing all unwanted knots using the offset tolerance. The method provides a good handle on error cont...

متن کامل

The intersection of two ruled surfaces

This paper presents an eecient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set nding problem for a bivariate function, which is also equivalent to the construction of an implicit curve in the plane. Each connected component of the surface intersection curve corresponds to a connected component in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999